Qubit Complexity of Continuous Problems
نویسنده
چکیده
The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. We show how to obtain the classical query complexity for continuous problems. We then establish a simple formula for a lower bound on the qubit complexity in terms of the classical query complexity.
منابع مشابه
The Quantum Setting with Randomized Queries for Continuous Problems
The standard setting of quantum computation for continuous problems uses deterministic queries and the only source of randomness for quantum algorithms is through measurement. Without loss of generality we may consider quantum algorithms which use only one measurement. This setting is related to the worst case setting on a classical computer in the sense that the number of qubits needed to solv...
متن کاملEstimating Jones and Homfly polynomials with one clean qubit
The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial of the trace closure of a braid at the fifth root of unity is a complete problem for the one clean qubit complexity class[18]. This is the class of problems solvable in polynomial time on a quantum computer acting on...
متن کاملSimulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity
We use an n-spin system with permutation symmetric zz-interaction for simulating arbitrary pair-interaction Hamiltonians. The calculation of the required time overhead is mathematically equivalent to a separability problem of n-qubit density matrices. We derive lower and upper bounds in terms of chromatic index and the spectrum of the interaction graph. The complexity measure defined by such a ...
متن کاملQuantum Feedback Control of a Solid-State Qubit
The principle of feedback control is used in a wide variety of physical and engineering problems. For example, it can be applied in a straightforward way to tune the oscillation phase of a harmonic oscillator in order to achieve a desired synchronization. An intriguing and fundamental question is whether continuous feedback can be used to control quantum systems; for instance, if it is possible...
متن کاملEstimating Jones polynomials is a complete problem for one clean qubit
It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model[12, 3, 1]. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maximally mixed state. One clean qubit computers are believed to be stri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005